The n-queens problem
نویسندگان
چکیده
منابع مشابه
The n-queens problem in higher dimensions
The 8-queens problem is a well-known chessboard problem, whose constraints are to place eight queens on a normal chessboard in such a way that no two attack each other, under the rule that a chess queen can attack other pieces in the same column, row, or diagonal. This problem can be generalized to place n queens on an n by n chessboard, otherwise known as the n-queens problem. The mathematicia...
متن کاملGraphical Simulation of N Queens Problem
Graphical simulation is an attempt of predicting the aspects of behavior of some system by developing an approximate model of it. Simulations have great impact on education and in training. Simulation based learning is a practical way of learning of practices that involves building connections: connections among what is being learned and what is important to the actor and the situations in whic...
متن کاملResults for the n-queens problem on the Möbius board
In this paper we consider the extension of the n-queens problem to the Möbius strip; that is, the problem of placing a maximum number of nonattacking queens on the m×n chessboard for which the left and right edges are twisted connected. We prove the existence of solutions for the m× n Möbius board for classes of m and n with density 25/48 in the set of all m × n Möbius boards, and show the impo...
متن کاملA Parallel Search Algorithm for the N-Queens Problem
The N-queens problem is to place n queens on an n n chessboard such that no two queens attack each other. This problem is commonly used as a benchmark for algorithms that solve constraint satisfaction problems (CSP). This paper describes a novel parallel algorithm for the N-queens problem. The algorithm nds a solution by performing a probabilistic parallel search. By using n processors, its run...
متن کاملThe N queens problem - new variants of the Wirth algorithm
The paper presents new ways of n-queens problem solving . Briefly, this is a problem on a nxn chessboard of a set n-queens, so that any two of them are not in check. At the beginning, currently used algorithm to find solutions is discussed. Then sequentially 4 new algorithms, along with the interpretation of changes are given. The research results, including comparison, of calculation times of ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Mathematics
سال: 1975
ISSN: 0012-365X
DOI: 10.1016/0012-365x(75)90079-5